Combinatorially Two-Orbit Convex Polytopes

نویسنده

  • Nicholas Matteo
چکیده

Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group coincide). Hence, a combinatorially two-orbit convex polytope is isomorphic to one of a known finite list, all of which are 3-dimensional: the cuboctahedron, icosidodecahedron, rhombic dodecahedron, or rhombic triacontahedron. The same is true of combinatorially two-orbit normal face-to-face tilings by convex polytopes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tiling Three-space by Combinatorially Equivalent Convex Polytopes

The paper settles a problem of Danzer, Griinbaum, and Shephard on tilings by convex polytopes. We prove that, for a given three-dimensional convex polytope P, there is a locally finite tiling of the Euclidean three-space by convex polytopes each combinatorially equivalent to P. In general, face-to-face tilings will not exist.

متن کامل

Se p 20 08 A Local Characterization of Combinatorial Multihedrality in Tilings ∗

A locally finite face-to-face tiling of euclidean d-space by convex polytopes is called combinatorially multihedral if its combinatorial automorphism group has only finitely many orbits on the tiles. The paper describes a local characterization of combinatorially multihedral tilings in terms of centered coronas. This generalizes the Local Theorem for Monotypic Tilings, established in [4], which...

متن کامل

On the Complexity of Isomorphism Problems Related to Polytopes

We show that the problem to decide whether two (convex) polytopes are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the polytope isomorphism problem in bounded dimension, which is based on Luks’ algorithm for the isomorphism problem of graphs of bounded maximal degree.

متن کامل

Combinatorial Aperiodicity of Polyhedral Prototiles∗

The paper studies combinatorial prototiles of locally finite face-to-face tilings of euclidean d-space Ed by convex d-polytopes. A finite set P of prototiles is called combinatorially aperiodic if P admits a locally finite face-to-face tiling by combinatorially equivalent copies of the prototiles in P, but no such tiling with a combinatorial automorphism of infinite order. The paper describes s...

متن کامل

Hard Lefschetz Theorem for Nonrational Polytopes

The Hard Lefschetz theorem is known to hold for the intersection cohomology of the toric variety associated to a rational convex polytope. One can construct the intersection cohomology combinatorially from the polytope, hence it is well defined even for nonrational polytopes when there is no variety associated to it. We prove the Hard Lefschetz theorem for the intersection cohomology of a gener...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2016